Drawing Planar Clustered Graphs in 2.5 Dimensions
نویسندگان
چکیده
Clustering techniques have proven to be useful in reducing the complexity of large networks. We present a method for drawing a clustered graph in 2.5D, given the clusters of the graph are connected in a planar way. The main contribution is to develop a weighted version of the well known 2D straight line drawing algorithm of de Fraysseix, Pach and Pollack [5] for planar graphs. This version allows for thick vertices and ensures a constraint we define as “visibility” between connected vertices. The algorithm has been implemented and experimentally evaluated.
منابع مشابه
Convex drawings of hierarchical planar graphs and clustered planar graphs
Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...
متن کاملClustered Level Planarity
Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable. Recently, several variations of planarity have been studied for advanced graph concepts such as k-level graphs [6,10–16] and clustered graphs [5,7]. In k-level graphs, the vertices are partitioned into k levels and the vertices of one level are drawn on a horizontal line. I...
متن کاملDrawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a divide and conquer approach. More specifically, it draws each cluster in a 2D plane to minimise occlusion and ease navigation. Then a 3D drawing of the whole graph is constructed by combining these 2D drawings. Our ma...
متن کاملComparison of Centrality-Based Planarisation for 2.5D Graph Drawing
Planarisation of graphs is a well studied research problem in Graph Theory and has important applications in Graph Drawing to draw non-planar graphs with as few crossings as possible. However, the problem of finding the maximum vertex (or edge) induced planar subgraph NP-hard. Centrality index is one of the important concepts in Network Analysis for analysing the importance of actors in the soc...
متن کاملSurvey on Planar Drawing of Clustered Graphs
In recent years, there has been great interest in graph drawing to express relational information and applications range from CASE tools, reverse engineering, idea organization, and software design. However, as the graphs to be visualized become more and more complex, extended structured graph variations are needed. Clustered graphs are graphs with recursive clustering structures. The possible ...
متن کامل